Location:
Search - data stream
Search list
Description: 用于Internet网络的数据流的例子，内附说明和实际例子-for Internet data flow example, enclosing notes and practical examples
Platform: |
Size: 53248 |
Author: 小卓 |
Hits:
Description: This small program is designed to demux a MPEG 2 file (also called Program Stream).Such movie file it s composed from various packs (video,audio,data,etc.). What this program does is to list every packet in a MPEG2 file along with some info about each pack.It might be interesting to know exactly how much audio or video your movie really contains.-This small program is designed to demux a MP EG 2 file (also called Program Stream). Such mov ie file it's composed from various packs (video, audio, data, etc.) . What this program does is to list every pa cket in a MPEG2 file along with some info about ea ch pack.It might be interesting to know exactly how much your audio or video movie really contai ns.
Platform: |
Size: 27648 |
Author: zhangqing |
Hits:
Description: 数据流联接查询技术研究,针对STREAM系统连接操作符酸法中进行了很多不必要探测的问题，提出了一个可以减少探测次数的改进算法-Data stream connection query technology research, for STREAM system operator acid were carried out to detect a lot of unnecessary problems, put forward a number can be reduced to improve the detection algorithm
Platform: |
Size: 2912256 |
Author: 杨明 |
Hits:
Description: 数据流关联规则挖掘算法moment，改算法由其作者提供。挖掘频繁闭项集。-Data Stream Association Rule Mining Algorithm moment, changed algorithm provided by the author. Mining Frequent Closed Itemsets.
Platform: |
Size: 22528 |
Author: ao |
Hits:
Description: 在VISUAL STDIO 2008下用C#编程来调用DTMF解码的DLL文件.通过将含有DTMF信息的音频数据流进行解码来识别对应按键的位置-In VISUAL STDIO 2008 using C# Programmed to call the DLL file DTMF decoder. By containing DTMF information to decode the audio data stream to identify the location of the corresponding button
Platform: |
Size: 780288 |
Author: 付晓强 |
Hits:
Description: 迄今为止见过的最方便的huffman编码，效率很高
一个外国人写的，很具有研究价值
Constructing a Huffman Tree according to the number of times each symbol appears in the data stream:
1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1).
2) Set the value of each node to the number of times that its symbol appears in the data stream.
3) Create a Minimum-Heap of N nodes.
4) Add every node whose value is greater than zero to the heap.
5) Extract the best two nodes in the heap.
6) Create a parent node whose children are the two extracted nodes.
7) Add the parent node to the heap.
8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap).
9) Extract the last node in the heap.
The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.
The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.-So far seen the most convenient huffman coding, efficient write a foreigner, I have research value Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes , representing N possible symbols (ranging between 0 and N-1) .2) Set the value of each node to the number of times that its symbol appears in the data stream.3) Create a Minimum-Heap of N nodes.4) Add every node whose value is greater than zero to the heap.5) Extract the best two nodes in the heap.6) Create a parent node whose children are the two extracted nodes.7) Add the parent node to the heap.8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap) .9) Extract the last node in the heap.The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.
Platform: |
Size: 17408 |
Author: 游弋人生 |
Hits:
Description: 对任何文件、数据流进行压缩的源代码。
并切提供Mobile平台支持!-Of any document, data stream compression of the source code. And cut to provide Mobile platform support!
Platform: |
Size: 158720 |
Author: anhl |
Hits:
Description: 文件流读取数据，实现文件的读入和读出，用C#作为编译平台-Read data stream, the read file and read out, using C# as a compiler platform
Platform: |
Size: 1024 |
Author: 北北 |
Hits:
Description: 分析流数据的数据挖掘算法，以及一个流数据的模拟产生器。-Analysis of the data stream of data mining algorithms, as well as a stream of data analog generator.
Platform: |
Size: 1671168 |
Author: Johnny |
Hits:
Description: 本源程序是一个基于Visual studio 2008平台的，用C#编写的以txt文本文档的形式存储数据流的例子。-This source code is a platform based on Visual studio 2008 using C# to txt text document written in the form of stored data stream example.
Platform: |
Size: 35840 |
Author: 王城 |
Hits:
Description: Thesis slide for data stream mining
Platform: |
Size: 866304 |
Author: zia |
Hits:
Description: Adwin C++ is a Adaptive sliding window model for frequent itemset mining over data stream
Platform: |
Size: 7168 |
Author: zia |
Hits:
Description: 流数据管理综述，概括介绍了流数据管理的框架，综述深入浅出-data stream management
Platform: |
Size: 67584 |
Author: 沙笔 |
Hits:
Description: java数据流应用相关技术及技巧，对数据流的各种处理方法-java data stream applications related technologies and techniques, data stream processing methods
Platform: |
Size: 57344 |
Author: sss |
Hits:
Description: c#，TCP协议实现视频聊天功能，通过程序捕获摄像头，实现本地视频功能及本地数据流转换，在两台电脑上显示对方视频，实现视频功能。-c#, TCP protocol for video chat, the camera captured through the process and achieve local video and local data stream conversion, in the other two computers on a video display for video functions.
Platform: |
Size: 45056 |
Author: 刘尚 |
Hits:
Description: 数据挖掘数据流处理，及clustream聚类的算法说明-Data mining data stream processing, and clustream clustering algorithm shows
Platform: |
Size: 2399232 |
Author: 工艺u |
Hits:
Description: In this era an emerging filed in the data mining is data stream mining. The current research technique of the data stream is classification which mainly focuses on concept drift data. In mining drift data with the single classifier is not sufficient for classifying the data. Because of the high dimensionality and does not get processed within considerable time, memory, false alarm rate is high, classification accuracy result is low. In this paper, proposed a Genetic based Intuitionistic fuzzy version of k-means has been introduced for grouping interdependent features. The proposed method achieves improvement in classification accuracy and perhaps to select the least number of features which show the way to simplification of learning task. The experimental shows that the advocated method performs well when compared with existing methods.
Platform: |
Size: 107520 |
Author: Opencvresearcher |
Hits:
Description: DATA STREAM
MINING
A Practical Approach
Platform: |
Size: 953344 |
Author: iamonow |
Hits:
Description: 关于数据流模型和算法的英文书籍,介绍了数据流的聚类、频繁模式挖掘等问题。-Data stream
Charu C. Aggarwal
Platform: |
Size: 22253568 |
Author: wmd |
Hits:
Description: presetation of data stream
Platform: |
Size: 3742720 |
Author: shabnam |
Hits:
« 12
3
4
5
6
7
8
9
10
...
47
»